Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries
نویسندگان
چکیده
منابع مشابه
Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries
We consider efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries for travelers using a train system. We propose to use timedependent networks as a model and show advantages of this approach over spacetime networks as models.
متن کاملRkNN Queries in Time-Dependent Road Networks
Erklärung Hiermit versichere ich, dass ich diese Masterarbeit selbständig verfasst und keine anderen als die ange-gebenen Quellen und Hilfsmittel verwendet habe. Zusammenfassung The problem of finding influence sets for a specific point, e.g. determining the influence of a location for a new restaurant on potential customers, can be realized by processing reverse k nearest neighbor queries. Alt...
متن کاملExact Solutions to Time-Dependent MDPs
We describe an extension of the Markov decision process model in which a continuous time dimension is incllMcd in the stat(', space. This allows tbr the representation and exact solution of a wide range of prohleins in which transitions or rewards vary over time. We examine problems based on route planning with public transportation and telescope observation scheduling.
متن کاملGoal Directed Relative Skyline Queries in Time Dependent Road Networks
The Wireless GIS technology is progressing rapidly in the area of mobile communications. Location-based spatial queries are becoming an integral part of many new mobile applications. The Skyline queries are latest apps under Location-based services. In this paper we introduce Goal Directed Relative Skyline queries on Time dependent (GD-RST) road networks. The algorithm uses travel time as a met...
متن کاملExact time-dependent density functional theory for impurity models.
We employ the density matrix renormalization group to construct the exact time-dependent exchange-correlation potential for an impurity model with an applied transport voltage. Even for short-ranged interaction we find an infinitely long-ranged exchange-correlation potential which is built up instantly after switching on the voltage. Our result demonstrates the fundamental difficulties of trans...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2004
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2003.12.019